Cost Sensitive Space Management in Shared Web Caches
نویسندگان
چکیده
In this paper, we present a new Web cache sharing scheme. Our scheme reduces the duplicated copies of the same objects in global shared Web caches, even though the hot working set of each local cache can be duplicated. Experimental results show that the proposed scheme outperforms existing sharing schemes for the data set we considered.
منابع مشابه
Hash-Routing for Collections of Shared Web Caches
Shared Web caches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization which provides shared caching to its Web clients will typically have a collection of shared caches rather than just one. For collections of shared caches, it is desirable to coordinate the caches so that all cached pages in the collection are shared amo...
متن کاملBiased Replacement Policies for Web Caches: Di erential Quality-of-Service and Aggregate User Value
Disk space in shared Web caches can be diverted to serve some system users at the expense of others. Cache hits reduce server loads, and if servers desire load reduction to di erent degrees, a replacement policy which prioritizes cache space across servers can provide di erential quality-of-service (QoS). We present a simple generalization of leastfrequently-used (LFU) replacement that is sensi...
متن کاملBiased Replacement Policies for Web Caches: Differential Quality-of-Service and Aggregate User Value
Disk space in shared Web caches can be diverted to serve some system users at the expense of others. Cache hits reduce server loads, and if servers desire load reduction to different degrees, a replacement policy which prioritizes cache space across servers can provide differential quality-of-service (QoS). We present a simple generalization of least-frequently-used (LFU) replacement that is se...
متن کاملVariable QoS from Shared Web Caches: User-Centered Design and Value-Sensitive Replacement
Due to differences in server capacity, external bandwidth, and client demand, some Web servers value cache hits more than others. Assuming that a shared cache knows the extent to which different servers value hits, it may employ a value-sensitive replacement policy in order to generate maximum aggregate value for servers. We consider both the prediction and value aspects of this problem and int...
متن کاملEvaluation of Design Alternatives for a Directory-Based Cache Coherence Protocol in Shared-Memory Multiprocessors
In shared-memory multiprocessors, caches are attached to the processors in order to reduce the memory access latency. To keep the memory consistent, a cache coherence protocol is needed. A well known approach is to record which caches have copies of a memory block in a directory and only notify the caches having a copy when a processor modifies the block. Such a protocol is called a directory-b...
متن کامل